Modelling and Verification of Cash Withdrawal Transaction in Automated Teller Machine Using Timed Automata
نویسندگان
چکیده
منابع مشابه
Modelling and Verification of Automated Transit Systems, Using Timed Automata, Invariants and Simulations
Our second project [14] showed how levels of abstraction, one of the most impor tant tools of discrete system analysis, can be used to reason about a simple acceleration maneuver. In this case, the goal is for a vehicle to reach a specified velocity vy at a specified t ime t I in the future. We assumed that the vehicle s tar ts at t ime 0 with velocity 0. The vehicle reports its velocity to the...
متن کاملEnhanced Automated Teller Machine Using Short Message Service Authentication Verification
The use of Automated Teller Machine (ATM) has become an important tool among commercial banks, customers of banks have come to depend on and trust the ATM conveniently meet their banking needs. Although the overwhelming advantages of ATM cannot be over-emphasized, its alarming fraud rate has become a bottleneck in it’s full adoption in Nigeria. This study examined the menace of ATM in the socie...
متن کاملVerification of Asynchronous Circuits using Timed Automata
In this work we apply the timing veriication tool OpenKronos, which is based on timed automata, to verify correctness of numerous asynchronous circuits. The desired behavior of these circuits is speciied in terms of signal transition graphs (STG) and we check whether the synthesized circuits behave correctly under the assumption that the inputs satisfy the STG conventions and that the gate dela...
متن کاملVerification of Printer Datapaths Using Timed Automata
In multiprocessor systems with many data-intensive tasks, a bus may be among the most critical resources. Typically, allocation of bandwidth to one (high-priority) task may lead to a reduction of the bandwidth of other tasks, and thereby e ectively slow down these tasks. WCET analysis for these types of systems is a major research challenge. In this paper, we show how the dynamic behavior of a ...
متن کاملEfficient Verification of Timed Automata using BDDs
This paper investigates the efficient reachability analysis of timed automata. It describes a discretization of time which preserves the reachability properties. The discretization allows to represent sets of configurations of timed automata as binary decision diagrams (BDDs). Further techniques, like computing good variable orderings, are applied to use the full potential of BDDs as compact an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1821/1/012031